On Dynamic Link Inference in Heterogeneous Networks | Proceedings of the 2012 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

نویسندگان

  • Charu Aggarwal
  • Yan Xie
  • Philip S. Yu
چکیده

Network and linked data have become quite prevalent in recent years because of the ubiquity of the web and social media applications, which are inherently network oriented. Such networks are massive, dynamic, contain a lot of content, and may evolve over time in terms of the underlying structure. In this paper, we will study the problem of dynamic link inference in temporal and heterogeneous information networks. The problem of dynamic link inference is extremely challenging in massive and heterogeneous information network because of the challenges associated with the dynamic nature of the network, and the different types of nodes and attributes in it. Both the topology and type information need to be used effectively for the link inference process. We propose an effective two-level scheme which makes efficient macroand micro-decisions for combining structure and content in a dynamic and time-sensitive way. The time-sensitive nature of the links is leveraged in order to perform effective link prediction. We illustrate the effectiveness of our technique over a number of real data sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Citation Prediction in Heterogeneous Bibliographic Networks | Proceedings of the 2012 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

To reveal information hiding in link space of bibliographical networks, link analysis has been studied from different perspectives in recent years. In this paper, we address a novel problem namely citation prediction, that is: given information about authors, topics, target publication venues as well as time of certain research paper, finding and predicting the citation relationship between a q...

متن کامل

Graph Regularized Meta-path Based Transductive Regression in Heterogeneous Information Network | Proceedings of the 2015 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

A number of real-world networks are heterogeneous information networks, which are composed of different types of nodes and links. Numerical prediction in heterogeneous information networks is a challenging but significant area because network based information for unlabeled objects is usually limited to make precise estimations. In this paper, we consider a graph regularized meta-path based tra...

متن کامل

Clustering and Ranking in Heterogeneous Information Networks via Gamma-Poisson Model | Proceedings of the 2015 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

Clustering and ranking have been successfully applied independently to homogeneous information networks, containing only one type of objects. However, real-world information networks are oftentimes heterogeneous, containing multiple types of objects and links. Recent research has shown that clustering and ranking can actually mutually enhance each other, and several techniques have been develop...

متن کامل

Multimodal Network Alignment | Proceedings of the 2017 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

A multimodal network encodes relationships between the same set of nodes in multiple settings, and network alignment is a powerful tool for transferring information and insight between a pair of networks. We propose a method for multimodal network alignment that computes a matrix which indicates the alignment, but produces the result as a lowrank factorization directly. We then propose new meth...

متن کامل

Community Detection for Emerging Networks | Proceedings of the 2015 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics

Nowadays, many new social networks offering specific services spring up overnight. In this paper, we want to detect communities for emerging networks. Community detection for emerging networks is very challenging as information in emerging networks is usually too sparse for traditional methods to calculate effective closeness scores among users and achieve good community detection results. Mean...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012